haRVey: combining reasoners
نویسندگان
چکیده
We present the architecture of the oncoming version of the SMT (Satis ability Modulo Theories) solver haRVey [5]. haRVey checks the satis ability of a formula written in a rst-order language with interpreted symbols from various theories. Its new architecture is original, rst in the sense that it is a combination of reasoners, rather than the traditional combination of decision procedures. Second, one of these reasoners is a full-featured rst-order saturation-based prover. Finally, some of those reasoners in the combination may only be sporadically activated not using computer time when inactive. We believe those new features will contribute to the e ciency and expressivity of the new version of the tool.
منابع مشابه
Combining Satisfiability Procedures for Automated Deduction and Constraint - Based Reasoning
Several constraint-based paradigms have been developed in Automated Reasoning which try to combine the advantages of domain-depended constraint solving with those of general-purpose reasoning. Although Constraint-based Reasoning has proven rather successful, it is often limited to frameworks operating essentially over a single constraint domain. Many potential applications of Constraint-based R...
متن کاملCombining Safe Rules and Ontologies by Interfacing of Reasoners
The paper presents a scheme for hybrid integration of rules languages with constraints languages including but not restricted to Description Logic-based ontologies. The proposed scheme is apt for logical rule languages such as Datalog, but also opens up for rules lacking logical semantics, e.g. the XML query and transformation language Xcerpt. To reason in the integrated language, we aim at re-...
متن کاملThe One-to-One Constraint in Analogical Mapping and Inference
Theories of analogical reasoning have assumed that a 1-to-1 constraint discourages reasoners from mapping a single element in 1 analog to multiple elements in another. Empirical evidence suggests that reasoners sometimes appear to violate the one-to-one constraint when asked to generate mappings, yet virtually never violate it when asked to generate analogical inferences. However, few studies h...
متن کاملInference Graphs: Combining Natural Deduction and Subsumption Inference in a Concurrent Reasoner
There are very few reasoners which combine natural deduction and subsumption reasoning, and there are none which do so while supporting concurrency. Inference Graphs are a graph-based inference mechanism using an expressive first– order logic, capable of subsumption and natural deduction reasoning using concurrency. Evaluation of concurrency characteristics on a combination natural deduction an...
متن کاملUSE-RB : Benchmarking how Reasoners Work in Harmony with Modern Hardware
As our computers embed more cores, efficient reasoners are designed with parallelization but also CPU and memory friendliness in mind. These latter contribute to make reasoner tractable in practice despite the computational complexity of logical fragments. However, creating benchmarks to monitor this CPU-friendliness for many reasoners, datasets and logical fragments is a tedious task. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006